A Fast and Robust Spectrogram Reassignment Method
نویسندگان
چکیده
منابع مشابه
A Fast, Robust, Automatic Blink Detector
Introduction “Blink” is defined as closing and opening of the eyes in a small duration of time. In this study, we aimed to introduce a fast, robust, vision-based approach for blink detection. Materials and Methods This approach consists of two steps. In the first step, the subject’s face is localized every second and with the first blink, the system detects the eye’s location and creates an ope...
متن کاملFast machine reassignment
This paper proposes a new method for solving the Machine Reassignment Problem in a very short computational time. The problem has been proposed by Google as subject of the Challenge ROADEF/EURO 2012. The Machine Reassignment Problem consists in looking for a reassignment of processes to machines in order to minimize a complex objective function, subject to a rich set of constraints including mu...
متن کاملRobust speech recognition using the modulation spectrogram
The performance of present-day automatic speech recognition (ASR) systems is seriously compromised by levels of acoustic interference (such as additive noise and room reverberation) representative of real-world speaking conditions. Studies on the perception of speech by human listeners suggest that recognizer robustness might be improved by focusing on temporal structure in the speech signal th...
متن کاملA Fast and Robust Watermarking Method for Jpeg Images
In this paper, a JPEG domain image watermarking method that utilizes spatial masking is presented. The watermarking algorithm works in the compressed domain, and can be implemented efficiently in real-time (only 50ms is required for a 512x512 24-bit color image on a 700MHz computer). In many applications, particularly those associated with delivering images over the Internet, the ability to wat...
متن کاملA fast, robust, and non-stiff Immersed Boundary Method
We propose a fast and non-stiff approach for the solutions of the Immersed Boundary Method, for Newtonian, incompressible flows in two or three dimensions. The proposed methodology is built on a robust semi-implicit discretization introduced by Peskin in the late 70’s which is solved efficiently through the novel use of a fast, treecode strategy to compute flow-structure interactions. Optimal m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7040358